A Non-Markovian Multistage Batch Arrival Queue with Breakdown and Reneging
نویسندگان
چکیده
منابع مشابه
A Diffusion Approximation for a Markovian Queue with Reneging
Consider a single-server queue with a Poisson arrival process and exponential processing times in which each customer independently reneges after an exponentially distributed amount of time. We establish that this system can be approximated by either a reflected Ornstein–Uhlenbeck process or a reflected affine diffusion when the arrival rate exceeds or is close to the processing rate and the re...
متن کاملA Batch Arrival Retrial Queue with Bernoulli Vacation Policy and Server Breakdown*
This paper examines the operating characteristics of an M/G/1 retrial queueing system under Bernoulli vacation schedule with setup times. The server renders first phase of essential service (FPS) to all the arriving units whereas second phase of multi-optional services (SPS) to only some of them who demand for the same. The server may breakdown according to Poisson process in working state i.e....
متن کاملBatch Markovian Arrival Processes (BMAP)
This article describes the batch Markovian arrival process (BMAP), a point process that is characterized by Markov-modulated batch arrivals of random size. The BMAP is a generalization of many well-known processes including the Markovian arrival process (MAP), the Poisson process, and the Markov-modulated Poisson process. It provides a common framework for modeling arrival processes in a variet...
متن کاملStationary Queue Length in a Fifo Single Server Queue with Service Interruptions and Multiple Batch Markovian Arrival Streams
Abstract This paper considers a FIFO single-server queue with service interruptions and multiple batch Markovian arrival streams. The server state (on and off), the type of arriving customers and their batch size are assumed to be governed by a continuous-time Markov chain with finite states. To put it more concretely, the marginal process of the server state is a phase-type alternating Markov ...
متن کاملFinite Buffer Vacation Queue under E-limited with Limit Variation Service and Batch Markovian Arrival Process
Abstract: We consider a finite-buffer single server queue with single (multiple) vacation(s) under batch Markovian Arrival Process (BMAP). The service discipline is varying number limited service, also called E-limited with limit variation (ELV) where the server serves until either the system is emptied or a randomly chosen limit of l customers have been served. Queue length distributions at va...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2014
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2014/519579